Oren Gates

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

OREN: Optimal revocations in ephemeral networks

Public-key certificates allow a multitude of entities to securely exchange and verify the authenticity of data. However, the ability to effectively revoke compromised or untrustworthy certificates is of great importance when coping with misbehavior. In this paper, we design a fully distributed local certificate revocation scheme for ephemeral networks – a class of extremely volatile wireless ne...

متن کامل

Lecture 2 Lecturer : Allan Borodin Scribe : Joel Oren 1

Last time we gave a Brute force+Greedy algorithm that runs in O(mm·s · n)-time to get a (1 + 1s )-approximation for the minimum makespan problem on m identical machines. If we fix m, so that the number of machines is not a parameter of the problem, and take s ≥ 1ǫ , then we get an algorithm that runs in O(m m/ǫ·n)-time algorithm and gives a solution that is a (1 + ǫ) approximation. If m is fixe...

متن کامل

Gates

Gates are a new notation for representing mixture models and context-sensitive independence in factor graphs. Factor graphs provide a natural representation for message-passing algorithms, such as expectation propagation. However, message passing in mixture models is not well captured by factor graphs unless the entire mixture is represented by one factor, because the message equations have a c...

متن کامل

Generalised Perspective Shape from Shading with Oren-Nayar Reflectance

Yong Chul Ju1 [email protected] Silvia Tozza2 [email protected] Michael Breuß1 [email protected] Andrés Bruhn3 [email protected] Andreas Kleefeld1 [email protected] 1 Institute for Applied Mathematics and Scientific Computing BTU Cottbus, Germany 2 Department of Mathematics Sapienza University of Rome, Italy 3 Institute for Visualization and Interactive Systems University of...

متن کامل

Pattern Equivariant Cohomology and Theorems of Kesten and Oren

In 1966 Harry Kesten settled the Erdős-Szüsz conjecture on the local discrepancy of irrational rotations. His proof made heavy use of continued fractions and Diophantine analysis. In this paper we give a purely topological proof Kesten’s theorem (and Oren’s generalization of it) using the pattern equivariant cohomology of aperiodic tiling spaces.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Critical Quarterly

سال: 2009

ISSN: 0011-1562,1467-8705

DOI: 10.1111/j.1467-8705.2009.01888_2.x